• Jump To … +
    main.js separate.js single.js web-apg-api.js main.js web-conv-api.js ast.js csv.js dangling-else.js display.js flags.js float.js limits.js main.js multiline-mode.js recursive.js replace.js rules.js split.js testonly.js trace.js udt.js unicode.js web-email.js word-boundaries.js main.js phone-number.js web-main.js web-phone-number.js main.js phone-number.js setup.js translate.js xml.js branch-fail-grammar.js main.js parent-mode-grammar.js setup.js universal-mode-grammar.js colors-app.js colors-callbacks.js colors.js main.js more-app.js more-setup.js more.js ast-callbacks.js bad-input.js basic.js ini-file.js main.js parser-callbacks.js setup.js trace.js anbncn.js and.js c-comment.js compound.js main.js nested.js not.js setup.js boundaries-grammar.js boundaries.js comment-grammar.js comment.js main.js negative-grammar.js negative.js positive-grammar.js positive.js setup.js main.js odata-grammar.js run.js setup.js area-code.js lookaround.js main.js phone-number.js setup.js simple.js all-operators.js default.js fancy-number.js limited-lines.js main.js select-operators.js select-rules.js setup.js main.js minimal.js parent-u.js parent.js phone-number.js setup.js stats.js trace.js universal-u.js universal.js callbacks.js grammar.js main.js parser.js writeHtml.js LICENSE.md README.md index.md
  • boundaries.js

  • §
    /*  *************************************************************************************
     *   copyright: Copyright (c) 2021 Lowell D. Thomas, all rights reserved
     *     license: BSD-2-Clause (https://opensource.org/licenses/BSD-2-Clause)
     *   ********************************************************************************* */
  • §

    This is a demonstration using look-around operators to define word boundaries. In this straight-forward grammar, parsing environment, it is a very artificial example. It simply wants to know if the whole word cat is found at the 10th character. However, in the context of a pattern matching engine (see apg-exp) it is very real use. You can examine the trace of each of these examples to see how the left boundary is matched, or not matched, using negative look-behind (!! or BKN) and the right boundary is determined with negative look-ahead (! or NOT).

    (function boundaries() {
      let input = 'The black cat is in the window.';
      const grammar = new (require('./boundaries-grammar'))();
      const setup = require('./setup');
      setup(input, grammar, 'boundaries-cat');
      input = "Don't truncate this line.";
      setup(input, grammar, 'boundaries-truncate');
      input = "It's a Bobcat, not house cat..";
      setup(input, grammar, 'boundaries-bobcat');
      input = "You can't categorize it.";
      setup(input, grammar, 'boundaries-catagorize');
    })();